#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL px,py;cin>>px>>py;
    LL disx=px-0;LL disy=py-0;
    string s;cin>>s;
    LL l=0;LL r=0;LL u=0;LL d=0;;
    for(LL i=0;i<s.size();i++){
        if(s[i]=='L') l++;
        if(s[i]=='R') r++;
        if(s[i]=='U') u++;
        if(s[i]=='D') d++;
    }
    bool flag1=1;bool flag2=1;
    if(disx>=0){
        if(r>=abs(disx)){
            flag1=0;
        }
    }
    if(disx<=0){
        if(l>=abs(disx)){
            flag1=0;
        }
    }
    if(disy>=0){
        if(u>=abs(disy)){
            flag2=0;
        }
    }
    if(disy<=0){
        if(d>=abs(disy)){
            flag2=0;
        }
    }
    if(flag1==0&&flag2==0){
        cout<<"YES"<<"\n";
    }
    else cout<<"NO"<<"\n";
  }
return 0;
}
